Improving Robustness via Disjunctive Statements in Imperative Programming

نویسندگان

  • Keehang Kwon
  • Sungwoo Hur
  • Mi-Young Park
چکیده

To deal with failures as simply as possible, we propose a new foundation for the core (untyped) C, which is based on a new logic called task logic or imperative logic. We then introduce a sequential-disjunctive statement of the form S : R. This statement has the following semantics: execute S and R sequentially. It is considered a success if at least one of S,R is a success. This statement is useful for dealing with inessential errors without explicitly catching them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern Matching via Choice Existential Quantifications in Imperative Languages

Selection statements – if-then-else, switch and try-catch – are commonly used in modern imperative programming languages. We propose another selection statement called a choice existentially quantified statement. This statement turns out to be quite useful for pattern matching among several merits. Examples will be provided for this statement. keywords: selection, pattern matching, choice quant...

متن کامل

Bounded-Choice Statements for User Interaction in Imperative and Object-Oriented Programming

Adding versatile interactions to imperative programming – C, Java and Android – is an essential task. Unfortunately, existing languages provide only limited constructs for user interaction. These constructs are usually in the form of unbounded quantification. For example, existing languages can take the keyboard input from the user only via the read(x)/scan(x) statement. Note that the value of ...

متن کامل

Reasoning with Inconsistent Possibilistic Description Logics Ontologies with Disjunctive Assertions∗

We present a preliminary framework for reasoning with possibilistic description logics ontologies with disjunctive assertions (PoDLoDA ontologies for short). Given a PoDLoDA ontology, its terminological box is expressed in the description logic programming fragment but its assertional box allows four kinds of statements: an individual is a member of a concept, two individuals are related throug...

متن کامل

The Primacy of Teacher Imperative Commentaries in the Improvement of Iranian English Majors’ Writing Ability

In this study, the researchers investigated a critical aspect of EFL/ESL writing pedagogy-the impact of teacher written commentary on student writer’s earlier drafts. Compositions of 80 Iranian undergraduate English majors were commented on using a trio of imperatives, statements, and questions on both content and form. Overall, the results indicated that the comments in the imperative form hel...

متن کامل

Program Analysis: Termination Proofs for Linear Simple Loops

Termination proof synthesis for simple loops, i.e., loops with only conjoined constraints in the loop guard and variable updates in the loop body, is the building block of termination analysis, as well as liveness analysis, for large complex imperative systems. In particular, we consider a subclass of simple loops which contain only linear constraints in the loop guard and linear updates in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 96-D  شماره 

صفحات  -

تاریخ انتشار 2013